Displaying browse sequence with search results

ABSTRACT

Systems and computer program products may display a browse sequence for a plurality of statically paginated web pages with search engine results. The system may include a processor and a memory. The system may additionally include a program comprising a plurality of instructions stored in memory that are executed by the processor to (1) identify, in the source code of one web page, one or more links to at least another web page; (2) identify, in the source code of the at least another web page, one or more links to the one web page; (3) determine a browse sequence for the one web page and the at least another web page based on the identified one or more links to the at least another web page and to the one web page; and (4) display the browse sequence along with search results on a search engine results page.

BACKGROUND

The present inventions relate to computerized search technologies, andmore specifically, to systems that display browse sequence of web pages,such as the browse sequence of statically paginated web pages, with thesearch results.

A computerized search system, such as an Internet search engine,receives queries from users, compares each query to an index, selects alist of results from the index, and returns the list to the user. Asearch system may be implemented in a client-server architecture. Theserver may host a web site that provides a form to accept queries andmay also host the back-end systems that build the index, parse queries,select results, and generate result pages. The client may run software,such as a web browser, that provides a user interface to accept queriesand display results via the search system web site. The result page,which may be generated by the server and displayed by the client, may beformatted for the user's convenience. For example, each item in a listof results may include text describing the indexed web page and ahyperlink to that page, so that the user can evaluate each result andvisit each web page that matched the query.

BRIEF SUMMARY

According to one embodiment, a method may include identifying, in thesource code of one web page, one or more links to at least another webpage, and identifying, in the source code of the at least another webpage, one or more links to the one web page. The method may additionallyinclude determining a browse sequence for the one web page and the atleast another web page based on the identified one or more links to theat least another web page and to the one web page. The method mayfurther include displaying the browse sequence along with search resultson a search engine results page, the search results includinginformation regarding one or more of the one web page and the at leastanother web page.

According to one embodiment, a computer system may include a processorand a memory. The computer system may additionally include a programcomprising a plurality of instructions stored in the memory that areexecuted by the processor to identify, in the source code of one webpage, one or more links to at least another web page, and identify, inthe source code of the at least another web page, one or more links tothe one web page. The plurality of instructions additionally comprisesinstructions that are executed by the processor to determine a browsesequence for the one web page and the at least another web page based onthe identified one or more links to the at least another web page and tothe one web page. The plurality of instructions further comprisesinstructions that are executed by the processor to display the browsesequence along with search results on a search results engine resultspage, the search results including information regarding one or more ofthe one web page and the at least another web page.

According to one embodiment, a computer program product for displaying abrowse sequence for a plurality of statically paginated web pages on asearch engine results page may include at least one computer readablestorage medium having computer readable program instructions embodiedtherewith. The computer readable program instructions, when read by aprocessor, may be configured to identify, in the source code of one webpage, one or more links to at least another web page, and identify, inthe source code of the at least another web page, one or more links tothe one web page. The computer readable program instructions, when readby a processor, may be additionally configured to determine a browsesequence for the one web page and the at least another web page based onthe identified one or more links to the at least another web page and tothe one web page. The computer readable program instructions, when readby a processor, may be additionally configured to display the browsesequence along with search results on a search engine results page, thesearch results including information regarding one or more of the oneweb page and the at least another web page.

Any of the above embodiments may be embodied as computer-based methods,systems, or program products.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

FIG. 1 is a pictorial representation of an example of a computer systemin which illustrative embodiments may be implemented.

FIG. 2 is a block diagram of an example of a computer in whichillustrative embodiments may be implemented.

FIG. 3 is a block diagram of an example of a computerized search systemin which illustrative embodiments may be implemented.

FIG. 4 is a block diagram of an example of a web site and acorresponding page navigator consisting of a set or series of pagebuttons in accordance with the principles of the present inventions.

FIG. 5 is a block diagram of an example of a previous-next browsesequence in accordance with the principles of the present inventions.

FIG. 6 is a block diagram of an example of a web page that includes apage navigator in accordance with the principles of the presentinventions.

FIG. 7 is a block diagram of an example of a search-engine results page(SERP) that includes a results list and a page block in accordance withthe principles of the present inventions.

FIG. 8 is a block diagram of an example of a page block having pageindicators for a page range and having first-, last-, next-, andprevious-page indicators in accordance with the principles of thepresent inventions.

FIG. 9 is a block diagram of an example of a page block that provideskeyword indicators for each page indicator in accordance with theprinciples of the present inventions.

FIG. 10 is a block diagram of another example of a page block that usesdifferences in shading applied to page indicators to indicatedifferences in the strength of a match in accordance with the principlesof the present inventions.

FIG. 11 is a block diagram of a further example of a page block thatuses a pie-chart device applied to page indicators to indicatepage-to-page differences in the strength of a match in accordance withthe principles of the present inventions.

FIG. 12 is a block diagram of another example of a page block that usesdifferences in the height of page indicators to form a bar chart toindicate page-to-page difference in the strength of a match inaccordance with the principles of the present inventions.

FIG. 13 is a block diagram of a further example of a page block thatincludes a keyword-specific bar chart associated with each pageindicator in accordance with the principles of the present inventions.

FIG. 14 is a block diagram of another example of a page block thatincludes a page indicator that displays a thumbnail image of thecorresponding indexed page in accordance with the principles of thepresent inventions.

FIG. 15 is a block diagram of a further example of a page block thatincludes a page indicator that displays annotations, comments, or thelike associated with the corresponding indexed page in accordance withthe principles of the present inventions.

FIG. 16 is a block diagram of another example of a page block in whichrecommended pages are labeled in accordance with the principles of thepresent inventions.

FIG. 17 shows an example of a method of identifying a browse sequence inthe code of a web page in accordance with the principles of the presentinventions.

FIG. 18 shows an example of a method of displaying a browse sequence fora plurality of statically paginated web pages on a search engine resultspage in accordance with the principles of the present inventions.

DETAILED DESCRIPTION

As will be appreciated by one skilled in the art, aspects of the presentinventions may be embodied as a system, method, or computer programproduct. Accordingly, aspects of the present inventions may take theform of an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module,” or “system.”Furthermore, aspects of the present inventions may take the form of acomputer program product embodied in one or more computer readablemedium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, or device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CD-ROM), an optical storagedevice, a magnetic storage device, or any suitable combination of theforegoing. In the context of this document, a computer readable storagemedium may be any tangible medium that can contain, or store a programfor use by or in connection with an instruction execution system,apparatus, or device.

A computer readable signal medium may include a propagated data signalwith computer readable program code embodied therein, for example, inbaseband or as part of a carrier wave. Such a propagated signal may takeany of a variety of forms, including, but not limited to,electro-magnetic, optical, or any suitable combination thereof. Acomputer readable signal medium may be any computer readable medium thatis not a computer readable storage medium and that can communicate,propagate, or transport a program for use by or in connection with aninstruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wireline, optical fiber cable, RF, etc., or any suitable combination ofthe foregoing.

Computer program code for carrying out operations for aspects of thepresent inventions may be written in any combination of one or moreprogramming languages, including an object-oriented programming languagesuch as Java, Smalltalk, C++, or the like and conventional proceduralprogramming languages, such as the “C” programming language or similarprogramming languages. The program code may execute entirely on theuser's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of the present inventions are described below with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to embodiments of theinventions. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer program instructions. These computer program instructions maybe provided to a processor of a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions thatimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus or other devices to produce a computerimplemented process such that the instructions that execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

With reference now to the figures and in particular to FIGS. 1 and 2,exemplary diagrams of data processing environments are provided in whichillustrative embodiments may be implemented. It should be appreciatedthat FIGS. 1 and 2 are only exemplary and are not intended to assert orimply any limitation with regard to the environments in which differentembodiments may be implemented. Many modifications to the depictedenvironments may be made.

The flowcharts and block diagrams in the figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present inventions. In this regard, each block in theflowcharts or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustrations,and combinations of blocks in the block diagrams and/or flowchartillustrations, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

FIG. 1 depicts a computer system, indicated generally at 10, andincluding a network of computers in which illustrative embodiments maybe implemented. Computer system 10 may contain a network 12, which isthe medium used to provide communications links between various devicesand computers connected together within computer system 10. Network 12may include connections, such as wire, wireless communication links, orfiber optic cables, or combinations of such connections.

In the depicted example, a server 14 and a server 16 may connect tonetwork 12 along with a storage unit 18. In addition, one or more clientcomputers may connect to network 12, such as a first client computer 20,a second client computer 22, and a third client computer 24. Clientcomputers 20, 22, and 24 may be, for example, personal computers workstations, or network computers. In the depicted example, server 14 mayprovide data, such as boot files, operating system images, and/orsoftware applications to client computers 20, 22, and 24. Clientcomputers 20, 22, and 24 are clients to server 14 in this example.Computer system 10 may include additional servers, clients, and otherdevices not shown, or may include fewer devices than those shown.

In the depicted example, network 12 may be or may include the Internet.Computer system 10 also may be implemented with a number of differenttypes of networks, such as for example, an intranet, a local areanetwork (LAN), or a wide area network (WAN). FIG. 1 is intended as anexample, and not as an architectural limitation for the differentillustrative embodiments.

With reference now to FIG. 2, a block diagram of an exemplary dataprocessing system 30 is shown in which illustrative embodiments may beimplemented. Data processing system 30 is an example of a computer, suchas server 14 or client computer 20 in FIG. 1, in which computer-usableprogram code or instructions implementing the processes may be locatedfor the illustrative embodiments. In this illustrative example, dataprocessing system 30 may include communications fabric 32, whichprovides communications between a processor unit 34, a memory 36, apersistent storage 38, a communications unit 40, an input/output (I/O)unit 42, and a display 44. In other examples, a data processing systemmay include more or fewer devices.

Processor unit 34, also referred to simply as a processor, may serve toexecute instructions for software that may be loaded into memory 36 frompersistent storage 38. Processor unit 34 may be a set of one or moreprocessors or may be a multi-processor core, depending on the particularimplementation. Further, processor unit 34 may be implemented using oneor more heterogeneous processor systems in which a main processor ispresent with secondary processors on a single chip. As anotherillustrative example, processor unit 34 may be a symmetricmulti-processor system containing multiple processors of the same type.

Memory 36 and persistent storage 38 are examples of storage devices. Astorage device is any piece of hardware that is capable of storinginformation either on a temporary basis and/or a permanent basis. Memory36, in these examples, may be, for example, a random access memory orany other suitable volatile or non-volatile storage device. Persistentstorage 38 may take various forms depending on the particularimplementation. For example, persistent storage 38 may contain one ormore components or devices. For example, persistent storage 38 may be ahard drive, a flash memory, a rewritable optical disk, a rewritablemagnetic tape, or some combination of the above. The media used bypersistent storage 38 also may be removable. For example, a removablehard drive may be used for persistent storage 38.

Communications unit 40, in these examples, provides for communicationswith other data processing systems or devices. For example,communications unit 40 may be a network interface card. Communicationsunit 40 may provide communications through the use of either or bothphysical and wireless communications links.

Input/output unit 42 allows for input and output of data with otherdevices that may be connected to data processing system 30. For example,input/output unit 42 may provide a connection for user input through akeyboard and mouse. Further, input/output unit 42 may send output to aprinter. Display 44 displays information to a user.

Instructions for the operating system and applications or programs arelocated on persistent storage 38. These instructions may be loaded intomemory 36 for execution by processor unit 34. The processes of thedifferent embodiments may be performed by processor unit 34 usingcomputer implemented instructions, which may be located in a memory,such as memory 36. These instructions are referred to as program code,computer-usable program code, or computer-readable program code that maybe read and executed by a processor in processor unit 34. The programcode in the different embodiments may be embodied on different physicalor tangible computer-readable media, such as memory 36 or persistentstorage 38.

Program code 50 may be located in a functional form on acomputer-readable media 52 that is resident on a local or remote storagedevice or is selectively removable and may be loaded onto or transferredto data processing system 30 for execution by processor unit 34. Programcode 50 and computer-readable media 52 form computer program product 54in these examples. In one example, computer-readable media 52 may be ina tangible form, such as, for example, an optical or magnetic disc thatis inserted or placed into a drive or other device that is part ofpersistent storage 38 for transfer onto a storage device, such as a harddrive that is part of persistent storage 38. In a tangible form,computer-readable media 52 also may take the form of a persistentstorage, such as a hard drive, a thumb drive, or a flash memory that isconnected to data processing system 30. The tangible form ofcomputer-readable media 52 is also referred to as computer-recordablestorage media. In some instances, computer-recordable media 52 may notbe removable.

Alternatively, program code 50 may be transferred to data processingsystem 30 from computer-readable media 52 through a communications linkto communications unit 40 and/or through a connection to input/outputunit 42. The communications link and/or the connection may be physicalor wireless, or a combination of physical and wireless in theillustrative examples. The computer-readable media also may take theform of non-tangible media, such as communications links or wirelesstransmissions containing the program code. The different componentsillustrated for data processing system 30 are not meant to providearchitectural limitations to the manner in which different embodimentsmay be implemented. The different illustrative embodiments may beimplemented in a data processing system including components in additionto or in place of those illustrated for data processing system 30. Othercomponents shown in FIG. 2 can be varied from the illustrative examplesshown. As one example, a storage device in data processing system 30 isany hardware apparatus that may store data. Memory 36, persistentstorage 38, and computer-readable media 52 are examples of storagedevices in tangible forms.

In another example, a bus system may be used to implement communicationsfabric 32 and may be comprised of one or more buses, such as a systembus or an input/output bus. Of course, the bus system may be implementedusing any suitable type of architecture that provides for a transfer ofdata between different components or devices attached to the bus system.Additionally, a communications unit may include one or more devices usedto transmit and receive data, such as a modem or a network adapter.Further, a memory may be, for example, memory 36 or a cache such asfound in an interface and memory controller hub that maybe present incommunications fabric 32.

With reference also to FIG. 3, a computerized search system, indicatedgenerally at 60, may be a hardware and/or software system that allows auser to find documents, facts, images, videos, and/or other items ofinterest via an indexed body of data. System 60 may comprise a searchengine 62 that provides a user interface 64 and may further comprise oneor more client devices 66, search servers 68, and/or communicationsnetworks 70 connecting clients 66 to servers 68, such as via Internet72. Search system 60 may be an example of computer system 10; clientdevice 66 may be an example of clients 20, 22, 24; server 68 may be anexample of servers 14, 16; and communications network 70 may be anexample of network 12. System 60 may include other, alternative, oradditional elements and/or may omit one or more elements.

Search engine 62 may be a portion of system 60 that analyzes a specifiedor discovered body of data, prepares one or more indexes 74 of the data,receives queries 76 from users, matches each query 76 to one or moreindexes 74 to identify relevant results, generates a search engineresult page (SERP) 78 from the selected results, and/or transmits SERP78 back to the requesting user. For example, an Internet search engine,such as Google, Bing, or Yahoo!, may use automated tools to find andindex web pages and other documents published on the Internet, host aweb page that provides a form to accept queries 76 from users, andreturn SERP 78 that contains a list of zero or more web pages and/orother documents or files that match the query.

Search server 68 may be a computer system that provides computationand/or communication resources for search engine 62. For example, server68 may provide resources for gathering and indexing data, matchingqueries to an index, selecting results, etc. Server 68 may also provideHTML, database, script-execution, and/or other services appropriate forhosting a web site that receives queries and delivers SERPs. Searchengine 62 may employ multiple servers 68 (e.g., to divide distinct tasksamong distinct servers).

User interface 64 may be any hardware/software system suitable forsubmitting query 76 to search engine 62 and/or displaying SERP 78returned by search engine 62. Some portions of interface 64 may run onserver 68, and other portions may run on client 66. For example,interface 64 may take the form of a web page hosted by server 68 andtransmitted to a web browser 65 on client 66. An illustrative SERP shownin FIG. 7 includes a form that offers a query field 100 to allow theuser to enter query 76 and a submit button 102 to allow the user totransmit query 76 to search engine 62.

Client device 66 may be any hardware and/or software appropriate tosupport interface 64. Examples of client devices 66 include personalcomputers, laptop computers, personal digital assistants, tabletdevices, touch-screen devices, touch-pad devices, smart phones, cellulartelephones, dedicated search appliances, search features embedded inproducts, etc. Client 66 may be in communication with network 70, suchas to exchange data with remote search engine 62.

Query 76 may be any data to be sought in, compared to, and/or matchedagainst one or more indexes 74. For example, query 76 may be a textstring submitted via interface 64 to search engine 62. A query mayinclude one or more keywords, which indicate terms of interest to bematched to indexed documents. A syntax for queries may offer options toform key phrases, to express logical relationships such as AND, OR, andNOT, to limit by proximity, etc. Query 76 is not necessarily text data.For example, search engine 62 may allow submission of image, video,audio, and/or spoken data as query 76.

Communications network 70 may include any data transmission pathwaybetween user interface 64 and search engine 62. Network 70 may be wiredand/or wireless and may include Internet 72. For example, network 70 mayinclude a local area network that connects client 66 to Internet 72 andthereby to search engine 62.

SERP 78 may be a message returned by search engine 62 to client 66 toindicate zero or more results that match submitted query 76. Forexample, SERP 78 may take the form of a web page generated by searchengine 62, transmitted to client 66, and displayed by a web browser onclient 66. SERP 78 may include a results list 104 (shown in FIG. 7),which may be a division or portion of SERP 78 used to display a seriesof result items, such as 106A-106B. Each result item 106 may indicate aparticular match identified in index 74 and may contain data thatdescribes the matched result. For example, index 74 may contain or referdata extracted and/or derived from web pages. For each indexed web page,index 74 may include data, such as a web page title, a URL, adescriptive snippet, etc. Result item 106 obtained from an indexaccordingly may display a formatted title, a hyperlink to the indicatedpage, snippet text, etc. SERP 78, by providing a formatted descriptionof each item 106, may help the user access the relevance of each item106 and may allow the user to view or visit the original document, ifdesired.

The client-server architecture shown in FIG. 3 is a representativeimplementation of search system 60. System 60 may be implemented indiverse contexts and structures. For example, search engine 62 and userinterface 64 may be parts of a freestanding search feature built into ahelp system shipped with a product. For another example, a computersystem may use a search engine to index the content of local storage andprovide interface 64 to find stored items via a generated index. Searchengine 62 and interface 64 may reside on the same computer and do notnecessarily communicate with each other via an external network. “Searchserver” and “client device” do not necessarily imply a client-serverarchitecture.

Referring now also to FIG. 4, a web site 80 may include a set of one ormore related web pages 82, such as web pages 82A-N, that are hosted on aweb server and accessible over a network. Each web page 82 may be adocument, implemented in a markup language (such as HTML) that mayinclude or refer to content, such as text, graphics, scripts, etc. Oneor more web pages 82 may link to other web pages or to other files onweb site 80 or elsewhere via one or more hyperlinks 84, such ashyperlinks 84A-N. Each hyperlink 84 may include an anchor (a visibleword, phrase, or image that, when clicked, opens a new document or a newsection of the current document) and a hypertext reference (a code thatspecifies the document or section to be opened, such as by its URL,and/or that specifies the behavior of a link when clicked, such as byexecuting a script). The appearance of anchors may differ according tocontext, such as by distinguishing the current page from other pages orby distinguishing visited pages from unvisited pages. The word“hyperlink” may sometimes be abbreviated to “link,” and the word“webpage” or phrase “web page” may sometimes be abbreviated to “page.”In FIG. 4 and elsewhere, the “A-N” notation may indicate any suitablerange, where “A” refers to a first item and “N” refers to a second,third, or subsequent item.

Set of hyperlinks 84 sometimes may connect web pages 82 according to asystematic relationship between the linked pages. Those web pages maysometimes be referred to as having “static pagination” or being“statically paginated.” An author of web site 80 may consider some orall its pages 82 as having a sequential relationship, similar to thesequential relationship among pages of a book. An author may start anarticle on a first web page, continue the article on a second web page,and conclude the article on a third web page, for example. These threepages, written to be read as a series, have a sequential relationship. Aset of web pages that are linked or cross-referenced according to asystematic relationship, such as a series, may be referred to as havinga “browse sequence.” The browse sequence may include overt or impliedpage numbering and may span an entire web site, a portion of a web site,or portions of multiple web sites. For example, a web site may containmultiple articles, each divided into multiple pages, where each articlehas a distinct browse sequence.

The web pages may include one or more page-based navigation featuresthat show the underlying relationships to the user and/or allow the userto navigate from page to page according to the relationships amongpages. Page-based navigation may indicate organizational associationsbetween pages by, for example, physical arrangement (e.g., a sequence ofbuttons) and/or by labels (e.g., page numbers expressed as text orgraphic anchors). Examples of such navigational features include pagebuttons, first-page/last-page buttons, and previous-page/next pagebuttons, which may be used alone or in any combination.

For example, FIG. 4 shows web site 80 comprising a set or series of webpages 82A-N. FIG. 4 also shows an example of a page-based navigationfeature or page navigator 86 comprising a set or series of page buttons88A-N. Each page button 88A-N links to corresponding web page 82A-N.Specifically, button 88A links to page 82A via hyperlink 84A; button 88Bto page 82B via hyperlink 84B, etc. The sequence of buttons 88A-N withinpage navigator 86 and the text or graphic anchor of each button mayreflect the organizational relationships (such as the browse sequence)of pages 82A-N. In FIG. 4, for example, the anchor of button 88A is“01,” implying that linked page 82A is the first page in the series; theanchor of button 88B is “02,” implying that page 82B is the second pageof the series; etc. Each page of the series of pages 82A-N may include acopy or a variation of page navigator 86. FIG. 6, for example, showsrepresentative page navigator 86 in context on web page 82. In FIG. 6,page navigator 86 provides set of page buttons 88 that allow the user tonavigate to other pages of an article 98 started on web page 82. Pagenavigator 86 may include a box drawn around page buttons 88 to showtheir association that represents a browse sequence for pages 82A-N. Thebox is only a representative graphic design technique for indicatingassociation or grouping.

Referring now also to FIG. 5, statically paginated web pages may bestructured such that each web page links to its logical neighbors toform an ordered series. For example, web site 80 comprising a series ofweb pages 82A-N that are arranged via a series of browse links 92A-N.Page 82A, the first page, links to page 82B, the second page, whichlinks back to page 82A, as shown by browse link 92A. Page 82B in turnlinks to page 82C, the third page, which links back to page 82B, asshown by browse link 92B. This pattern repeats, with each page linked toits neighbors. Each browse link 92 accordingly may be implemented as apair of links, one on each neighboring page, so that each page links tothe other. Although not shown in FIG. 5, first page 82A may link to lastpage 82N, and vice versa, creating a circular structure. The abovestructure can be effective for web sites that include content withsequential relationships. A web site that implements an alphabeticalreference, for example, might link its pages in an alphabeticalsequence.

Page navigator 86 may express or display a browse sequence of web pages82A-82N via page buttons linked to neighboring pages. For example, pagenavigator 86 may include a page button linked to the previous page. Ifthe current page is page 4, for example, then clicking the previous-pagebutton may change the current page to page 3, in effect decrementing thecurrent page number. The anchor for a previous-page button may include atext link (such as “previous,” “PREV,” or “back”); an icon or graphic(such as “<”); and/or another indication of the next-lower page. Pagenavigator 86 similarly may include a button linked to the followingpage. For example, if the current page is page 10, then clicking thefollowing-page button may change the current page to page 11, in effectincrementing the page number. The anchor for a following-page button mayinclude text (such as “next page,” “NEXT,” or “more”); an icon orgraphic (such as “<”); and/or another indication of the following page.

Set of page buttons 88, numbered or otherwise arranged in series, mayexpress or represent a browse sequence as a result of including linksfrom the current page to its upper and/or lower neighboring pages (thatis, to the next and/or previous pages) in a set of statically paginatedpages. Although page navigator 86 may contain additional page buttons(such as buttons linked to non-neighboring pages), the presence ofbuttons linked to the upper and/or lower neighbors establishes a browsesequence equivalent to that of the next-page and previous-page buttons.For example, if the current page is page 3 and page navigator 86includes a set of buttons that link to pages 1, 2, 3, 4, and 5, then thepage 2 button is equivalent to a previous-page button and the page 4button is equivalent to a next-page button.

Statically paginated web pages may include a set of standing links toimportant pages within a set or series of pages. For example, pagenavigator 86 may include a page button linked to the first page of theset of pages. The anchor for this button may include text (such as “pageone,” “FIRST,” or “start”); an icon or graphic (such as “<<”); oranother indication that the button is linked to an initial page (such asthe start of an article, a table of contents, or the like). Pagenavigator 86 may have a similar button linked to the last page of astatically paginated set. The anchor for this button may include text(such as “LAST,” “end,” or “finish”); a graphic (such as “>>”); oranother indication that the button is linked to the terminal page (suchas the end of the content, a summary, or an index). For example, pagenavigator 86 may not have room to include a numbered page button foreach page of a large set and may show only selected pages, such as arange of pages. Page navigator 86 accordingly may include a first-pagebutton 96 and/or a last-page button 97 to act as a standing shortcut tothe beginning and/or end of the article.

Referring now also to FIG. 6, a web page that is part of a staticallypaginated set may include page navigator 86 that includes page buttons88 linked to some or all of the pages in the set, and that allows theuser to jump to other linked pages. In the example of FIG. 6, web page82 includes an article 98 that has been divided into a series of fiveweb pages, each with a distinct file name and URL. FIG. 6 happens toshow the first of the five pages and includes only an introductoryportion of article 98. To expedite access to the rest of article 98,each page of article 98 includes page navigator 86 that links to one ormore pages of article 98, such as via set of page buttons 88. Eachbutton 88 may link to another page of article 98 and have an appropriatelabel, such as a page number or descriptive text displayed as anchortext, a graphical button, or the like. Page navigator 86 includes a setof numbered page buttons 88A-N, one for each page of article 98. Button88B (labeled 02) links to the second page; button 88C (labeled 03) linksto the third page; etc. Especially for articles with many pages, pagenavigator 86 on a given page may display set of buttons 88 for only aportion of the statically paginated set, such as by showing a specifiednumber of upper and/or lower neighbors.

Page navigator 86 of FIG. 6 also includes a previous-page button 94 anda next-page button 95 so that each page of article 98 links to its lowerand upper neighbors, which may be similar to turning pages in a printedbook. Each page of article 98 accordingly may have its own version ofpage navigator 86 that is adjusted to the appropriate relativerelationships between pages, and that potentially omits inapplicablerelationships (e.g., the last page may have no next page). The pagenavigator 86 further includes a first-page button 96 and a last-pagebutton 97, which may expedite access to the start and end of article 98.

“Article” may refer to any document, description, discussion, news item,or other unit of content including authored content, generated content,blog entries, bulletin-board threads, “top” lists, image galleries,slideshow features, and so on. A blog system, for example, may beconfigured to treat the most-recent entry as the first or front page ofa statically paginated article and may treat each older entry as adistinct page with a higher page number. A bulletin-board system, foranother example, may treat a forum thread as a statically paginatedarticle. As contributors extend the thread, the article may be dividedinto a series of pages with the most-recent entry at the top of thefirst page.

In the example of FIG. 4, the file names follow a naming convention thathighlights the serial relationship among the web pages. For example,Page 82A, the first page, has the file name “page_(—)1.htm,” and eachsubsequent page increments the digit in the file name. Namingconventions may simplify authoring, and authoring tools and publishingsystems may automatically apply naming conventions. It is the systematiclinking relationships, and not necessarily the self-documenting filenames, that establish the browse sequence. The relationships between theweb pages may be logical or conceptual, independent from the file names,and expressed by associations, such as the physical arrangement of thebuttons within page navigator 86 and/or the text or graphic anchor ofeach button.

Techniques for creating web pages include directly writing code with atext editor, indirectly writing code with an authoring tool, and/orgenerating code with a content management system (CMS) or with relatedtools, such as bulletin boards, forums, blog systems, wikis, or thelike. Any of these techniques may be used to produce web site contentwith static pagination. For example, an author using a CMS may definearticles as containers for content, where each article may be a newsitem, a discussion of a subject, a blog entry, or the like. The CMS maystore the articles and other data in a database, generate web pages todisplay each article, and provide options to divide articles intomultiple pages (e.g., by setting a maximum length for generated pages).For a multi-page article, the CMS may automatically order the pages inseries and provide page-based navigational features to link the pagestogether. Although a CMS may automate the process of creating staticallypaginated web pages, it is possible to write identical or equivalentcode without relying on a CMS. For a hand-coded site, for example, theauthor may implement sequential pagination as part of the site design,e.g., by observing a convenient file naming convention and codingnavigational features that expose the pagination.

A publishing system may limit each generated web page to a specifiedlength. An article that is too long to fit on one web page may bedivided into a series of two or more pages. A publishing system mayapply static pagination separately to each article. For example, the endof each page may display a link to the next page, with a text or graphicanchor (such as “MORE”). Blog, bulletin board, and similar software maysimilarly control page size so that long blog entries, forumdiscussions, or the like flow to multiple web pages. These sequentialpages may be statically paginated to, for example, simplify navigationin a long discussion on a forum.

Referring now also to FIG. 7, SERP 78 may refer to a staticallypaginated article via a result item 106 that includes a page block 110.Page block 110 may include a plurality of page indicators 112. Each pageindicator 112 may be a page-button-like device that may link to acorresponding indexed web page or refresh the SERP (e.g., to show adifferent range or set of page indicators 112). Indicator 112 maydisplay a label or anchor suitable for the associated page. Labels oranchors may display page numbers or indicate previous, next, first,last, or omitted pages. Each indicator 112 may take the form of a hitindicator 114 (to indicate a page that matched the query) or a missindicator 116 (to indicate a page that did not match). The arrangement,sequence, and/or text or graphic anchors of indicators 112 may reflectthe browse sequence of the indexed article. Page block 110 accordinglymay in effect encapsulate references to a multi-page article into asingle result item 106, provide page-based access to the indexedarticle, and indicate one or more pages within article 98 that matchquery 76 that generated SERP 78.

For example, in the representative SERP of FIG. 7, result item 106Brefers to an article that includes a series of six web pages linkedtogether via static pagination. Item 106B includes page block 110 thatincludes six page indicators 112, one for each page of the indexedarticle, arranged in series according to the browse sequence of theindexed article. Clicking an indicator 112 opens the associated page.The sequence and labels (anchors) of indicators 112 reflect the browsesequence of the series of web pages. For example, the first indicator islinked to the first page of the article and labeled “1,” the secondindicator is linked to the second page of the article and labeled “2,”and so on. Each label (anchor) may be implemented as, for example, atext string or a graphic button linked to the indicated web page. In theexample, query 76 matched the fourth page of the article, and the otherfive pages did not match. Indicator 112 for the fourth page accordinglytakes the form of a hit indicator 114 (distinguished by, e.g., a darker,solid outline), and the other indicators 112 are miss indicators 116(distinguished by, e.g., a lighter, dashed outline). Result item 106Btherefore links to the series of web pages in the article and shows howthe search results for the article map to the associated, staticallypaginated web pages in the article. In FIG. 7, the box drawn around setof indicators 112 is only a representative graphic-design technique forshowing an association (or browse sequence for the series of web pages)of indicators 112. Many other techniques for showing grouping may beused including color, size, proximity, sequence, etc.

Page block 110 of SERP 78 may resemble page navigator 86 of web page 82.For example, page indicators 112 in page block 110 for an indexedarticle may resemble page buttons 88 in page navigator 86 for thatarticle. Page block 110, unlike page navigator 86, is a portion of SERPresult item 106, generated by search engine 62 from data collected aboutthe indexed article from the web pages that carry the article and/orfrom other sources. For example, search engine 62, when generating pageblock 110, may include data, features, or functions derived from theindexed web page (including its page navigator); from other web pages onthe same site or elsewhere; and/or from other sources, such as thesearch engine itself. For example, page block 110 may summarize thepage-match result obtained from index 74.

The search engine 62 may sometimes format page block 110 to look and/oract similar to a page navigator 86 found on the associated indexed webpage so that, for example, the user can easily see the correspondencebetween the SERP result and the indexed page. From a user's intuitiveperspective, page block 110 in a SERP may strongly resemblecorresponding page navigator 86, as if page navigator 86 were moved fromthe indexed page to the SERP. In implementation, page navigator 86 is afeature of the indexed page, and corresponding page block 110 is afeature generated by the search engine as a portion of a SERP. The pageblock may derive from the associated page navigator, however, and mayresemble the page navigator.

Because the search engine independently generates page block 110 by, forexample, analyzing, interpreting, and representing data extracted fromthe indexed web site, page block 110 may differ in appearance and/orfunction from any page navigators found on the indexed web pages. Thelabels on page buttons 88 on the web page may show simple alphabeticalpagination, for example, while the corresponding labels on the pageindicators 112 on the SERP may instead show numerical pagination in a“page X of Y” format. Many other differences are possible to adapt thepage block to its use on a SERP.

Page indicator 112 may take the form of hit indicator 114 (or the searchengine selected the page as a match to the query) or miss indicator 116(or the search engine did not select the page as a match to the query).In an embodiment, a difference in line type may distinguish hitindicators 114 from miss indicators 116. In FIG. 7, for example, adashed outline indicates a miss, and a solid outline indicates a hit.Alternative or additional embodiments for distinguishing hit from missmay include the use of different colors, shades of grey, and/or degreesof transparency; the presence, absence, or rate of pulsation; thepresence, absence, or appearance of a glowing effect; arrows or othersymbols that call attention to the page indicators of matching pages;and/or other graphical and/or audible effects, alone or in combination.For some indexed articles, page block 110 may include a page indicator112 for each page of the article. In the example of FIG. 7, the indexedarticle has six pages, and page block 110 has enough room for sixnumbered page indicators 112. For other indexed articles, it may bepractical or preferable to omit page indicators 112 for some pages. Fora long article spanning many pages, for example, page block 110 may nothave enough room to include page indicator 112 for each page.

Referring now also to FIG. 8, page block 110 may include a set of pageindicators that show a range or subset of pages, indicated generally at120, from the indexed article. The search engine may select the range orsubset to be displayed by identifying the single best match andincluding a specified number of pages above and below that of the bestmatch; by attempting to display multiple matches plus (if possible)bracketing pages; and/or by other space-fitting techniques. In theexample of FIG. 8, the indexed article has 30 pages, with matches on atleast pages 21, 23, and 29. Illustrative page block 110 in FIG. 8 showsa range of pages (pages 21 through 30) selected to include the matchingpages, in this instance by omitting pages 1 through 20 and 24 through28.

Query 76 may return a sparse result when matched to an article. In anembodiment, page block 110 may omit page indicators 112 for pagesbefore, inside, and/or after a displayed range 120 and may indicate theomission by a design element (such as by an ellipsis character). In anembodiment, page block 110 may indicate an omission by an omitted-pageindicator 122, which is a type of page indicator that represents one ormore page indicators 112 excluded from range 120. For omitted-pageindicator 122, the anchor may be a suitable word, phrase, symbol, icon,or graphic (such as an ellipsis character) and the hypertext referencemay link to an appropriate web page (such as an omitted matching page ora page in the middle of an omitted range). In an embodiment, thehypertext reference for omitted-page indicator 122 may in effect causesearch engine 62 to refresh (or generate and transmit) an updated SERP78 that includes page indicators 112 for all or part of the omittedrange of pages (e.g., a new SERP centered on the omitted range).Refreshing a SERP may include updating descriptive text (e.g., pagetitle and snippet) as well as the page block (e.g., page indicators andassociated hypertext references).

For example, for an article that contains one hundred pages, query 76may match only three pages. Discontiguous matched pages may make itdifficult to generate page block 110 that includes page range 120 thatspans all of the matched pages. It may be practical or preferable toinstead generate page range 120 with one or more omissions in order toinclude a larger number of matched pages. In the example of FIG. 8,pages 24 through 28 are non-matching so the page block omits pages 24through 28 to avoid omitting matching page 29. In the example, theanchor is an ellipsis character and the hypertext reference may be areference to page 26 (the center of the omitted range). Clicking thisomitted-page indicator 122 accordingly may in effect request a refreshedSERP 78 that includes page indicator 112 for page 26.

In an embodiment, page block 120 may include page indicators 112 mainlyor only for matching pages, which may maximize the number of displayedmatches (hits) by eliminating many, most, or all non-matches (misses).With reference to FIG. 8, in an embodiment, page indicator 112 may takethe form of a previous-page indicator 124, such as one with anappropriate hypertext reference (link) and an appropriate anchor (label)(e.g., “<”, “−”, “PREV”, or “BACK”). In an embodiment, the hypertextreference of previous-page indicator 124 may directly open the indexedweb page immediately “below” the lowest-numbered page referenced incurrent page block 110. For example, if the first displayed pageindicator 112 in page block 110 refers to the second page of an article,previous-page indicator 124 may simply open the first page of theindexed article. In an embodiment, previous-page indicator 124 mayrefresh the SERP after decrementing the lowest-numbered page referencedin the current page block. For example, if the current page blockdisplays pages 43 through 53, then clicking the previous-page indicator124 may refresh the SERP to include page indicators for pages 42 through52.

Page indicator 112 may take the form of a next-page indicator 125, suchas one with an appropriate link and label (e.g., “>”, “+”, or “NEXT”)Next-page indicator 125 may be generally similar to previous-pageindicator 124, except that next-page indicator 125 increments thepagination displayed in page block 110 instead of decrementing it. In anembodiment, next-page indicator 125 may directly open the indexed webpage immediately “above” the highest-numbered page referenced in thecurrent page block. In an embodiment, a next-page indicator may ineffect refresh the SERP after incrementing the highest-numbered pagereferenced in the current page block.

In an embodiment, previous-page indicator 124 and/or last-page indicator125 may function as hit indicator 114 or miss indicator 116. Forexample, if page block 110 displays range 120 of page indicators 112selected to display certain matches to a query, but further matchesexist below the displayed range, then previous-page indicator 124 mayfunction as hit indicator 114. As shown in FIG. 8, for example, nextindicator 125 uses line type (a dark outline) to indicate that furtherhits exist beyond displayed range 120. In an embodiment, a previous-pageindicator (or next-page indicator) that functions as a hit indicator mayrefresh page block 110 to include the previous (or next) hit, ratherthan refresh the page block to include the decremented (or incremented)page number. In an embodiment, a page block may provide distinct“previous page” and “previous hit” indicators and/or distinct “nextpage” and “next hit” indicators, such as to allow the user to navigatewithin the SERP either by pages in the article or by matches in theindex applied to the article.

In an embodiment, page indicator 112 may take the form of a first-pageindicator 126, such as one with an appropriate link (hypertextreference) and an appropriate label (anchor) (e.g., “<<”, “1ST”, or“FIRST”). In an embodiment, the link for first-page indicator 126 mayopen the associated indexed web page, such as the first page in thestatic pagination for the indexed article. In an embodiment, the linkfor first-page indicator 126 may refresh the SERP to show the SERP incontext of the first page of the indexed article. For example, if thecurrent SERP includes a page block that shows a range of pages in themiddle of an article, omitting the first page, then the link forfirst-page indicator 126 may refresh the SERP (or just the result item)show a page block that includes a page indicator that refers to thefirst page of the indexed article. Whether the link exits or refreshesthe SERP may depend on context (the query, article, user history, etc.).

Page indicator 112 may take the form of a last-page indicator 127, suchas one with an appropriate link and label (e.g., “>>” or “LAST”).Last-page indicator 127 may be generally similar to the first-pageindicator, except that it is directed at the end of an article ratherthan the beginning of an article. In an embodiment, last-page indicatormay link to the last page of the indexed article and/or may refresh theSERP to include a page indicator that refers to last page of the indexedarticle.

With reference now also to FIG. 9, query 76 may contain multiplekeywords, a term that herein includes key phrases. When search engine 62matches a query to a web page, each keyword may contribute to the match.For example, if a query specifies or implies the logical OR of two ormore keywords, then the presence of any keyword may be sufficient totrigger a match. For each match, it may be helpful to show the userwhich of the keywords matched. In an embodiment, page indicator 112 maydistinguish between keywords in a query via a keyword indicator 130,which may be text, graphic, audible, pop-up, and/or other indication ofa matching or non-matching keyword. For example, keyword indicator 130,also referred to as a search term indicator, may be a dot, circle,dog-ear symbol, or other mark inside or outside page indicator 112 andarranged in a sequence by keyword. Keyword indicators may include ameans of displaying the associated keyword.

In the example of FIG. 9, each keyword in query 76 is associated with acorner of each page indicator 112. The first keyword in the query mapsto the top-left corner; the second to the top-right corner; and so on,continuing clockwise. In the example, the indication means is a circlethat is present to indicate “hit” and absent to indicate “miss.” Theuser may thus review the page-specific hits by keyword at a glance. Pageindicators 112 may include hit indicators 114A and 114B. Indicator 114Aincludes keyword indicator 130 in the top-left corner, representing amatch to the first keyword in the query. Indicator 114B includes keywordindicators 130 in the top-left and bottom-right corners, representing amatch to the first and third keywords. In this example based onquadrants, the fifth and subsequent keywords may be ignored ordifferently represented.

In an embodiment, keyword indicator 130 may display the number ofoccurrences of the associated keyword on the associated page. A keywordindicator may display a page-match or page-rank value calculated forthat keyword and page. Alternative or additional embodiments of keywordindicator 130 may represent keyword-specific match results as bargraphs, text, and/or numerical values, etc. The display mechanism forkeyword indicators may include pop-up windows triggered by an event,such as a shift-click or mouse-over. For example, keyword indicator 130implemented as a pop-up window triggered by hovering over page indicator112 may enable a page-specific, formatted display of detailedsearch-engine data associated with a long or complex query.

The algorithms that determine whether a web page is a hit or a miss withrespect to a particular query or keyword do not necessarily return anabsolute or binary hit/miss result. An algorithm may instead evaluateeach page to calculate a score or other measure of the strength of thematch. A higher score may indicate a closer match, for example, and alower score may indicate a more distant match, (e.g., a page scored 73would have a stronger correlation to the query than one scored 17). In aconventional SERP, the match considered best may be the one at the topof the result list, with weaker matches progressively deeper in thelist. Because page block 110 may encapsulate multiple web pages (such asall of the pages in a given article), it may be desirable to indicatestronger or weaker matches within the page block. In an embodiment, pageindicators 112 may disclose or reflect the score value associated witheach indexed page instead of (or in addition to) providing generalizedhit/miss indication. For example, in an embodiment, the size of pageindicator 112 may indicate the strength of the match. A larger size mayindicate a stronger match, for example, and a smaller size may indicatea weaker match.

Referring now also to FIG. 10, alternative or additional embodiments mayrepresent the strength of a match by color coding (e.g., red for “hot”hits), grayscale range (e.g., darker is stronger), numeric score values,pie-chart graphics, bar-graph indicators, sorting the page indicators inscore order instead of page order (e.g., best match at the left edge),etc. FIG. 10 depicts an example that uses shading to indicate thestrength of a match. Page indicators 112 include hit indicators 114A and114B and miss indicator 116. In the example, the model is “a darkershade means a stronger hit.” Hit indicator 114B includes a strengthindication 140B with the dark shade to indicate a strong hit; hitindicator 114A includes a strength indication 140A with a medium shadeto indicate a weak hit; and miss indicator 116 remains unshaded to showa non-hit.

Referring now also to FIG. 11, strength indication 140 may take the formof a pie chart. For example, page indicators 112 have a circularperimeter, where the shaded area inside the circle reflects the strengthof the match for the associated indexed page. Hit indicator 114A, forexample, includes pie-chart strength indication 150A for a page with amoderately strong match (a medium score), represented by shading abouthalf of the circle. Hit indicator 114B, for another example, includes astrength indication 150B for page with a weaker score, represented byshading about one-quarter of the circle. Miss indicator 116, in turn,corresponds to an indexed page that has a zero or near-zero correlationto the query—as shown by an absence of shading at 150C.

Referring now also to FIG. 12, strength indication 140 may take the formof a bar graph. The height of each page indicator 112 may, for example,reflect the strength of the associated match. A tall indicator mayrepresent a strong match, for example, and a short indicator mayrepresent a weak match (e.g., so that a user can scan the profile of theindicators 112 to see a page-to-page variation in the correlation of thearticle to the query). In FIG. 12, hit indicator 114A, with a mediumheight, shows a moderately strong match; hit indicator 1148, with ataller height, shows a stronger match; and miss indicator 116, with ashort height, shows a weaker match or a non-match.

Referring now also to FIG. 13, strength indication 140 may include anassociated bar chart to indicate, for example, keyword-specific matchdata for each indexed page. Each page indicator 112 may include anassociated bar graph 170 to detail match data, such as a match-strengthvalue separately calculated for each keyword. For example, hit indicator114A has an associated bar graph 170A that contains a data bar for eachof four keywords, where the height of each bar shows the strength of thematch for the associated keyword. For indicator 114A, the first keywordis a non-match; the second is a weak match; the third is a strong match;and the fourth is a medium match. Hit indicator 114B shows differentbar-graph values for the four keywords, and miss indicator 116 showsweak matches that fall below a threshold for considering the page to bea hit.

In an embodiment, page indicator 112 may provide a feature that displaysa preview of the associated indexed web page to the user. The previewmay be, for example, a thumbnail image or a text summary. The previewdisplay may include a trigger event and a display mechanism. The triggerevent, which functions as a request the view the preview for the indexedpage associated with page indicator 112, may be a shift-click, amouse-over event (such as a hover), or other detectable event or actionassociated with a page indicator. The trigger event may be referred toas a “selection.” The display mechanism may be a pop-up window, arollover image, a refreshed version of the SERP that includes thepreview, or other presentation of preview image or text.

Referring now also to FIG. 14, hovering the mouse over a particular pageindicator 174 acts as a trigger event and yields a pop-up window 176that contains a preview image 178 of all or part of the associated webpage, such as to allow the user to evaluate the page without opening thepage itself and/or exiting the SERP. The search engine may generate apreview image of the page beforehand (e.g., by preparing and storing athumbnail image of the page when crawling the web to place the page inthe index) or on request, substantially in real time (e.g., by accessingthe page itself or by stored data, such as a cached version of thepage). The detection of the trigger event, the opening of pop-up window176, and the display of preview image 178 may include the use of one ormore scripts, such as to push thumbnail image 178 from search server 68to client device 66 and web browser 65.

In an embodiment, preview image 178 may include query-related features,such as highlighting applied to keywords present in query 76 and inpreview image 178. A trigger event may yield a display mechanism thatcontains data in addition to or other than a preview image. For example,a mouse-over or hover may open a pop-up window that contains dataobtained from a database, the search-engine index, and/or other sources.

In an embodiment, page indicator 112 may provide a mechanism fordisplaying page comments associated with an indexed web page. Commentsmay include remarks, ratings, rankings, recommendations, feedback,and/or other content contributed to a web page, such as by registeredusers of a web site via interactive features provided to encourageparticipation by a community of users. Comments may include text,hypertext, and/or images; user indicia (such as signature text andavatar images); and generated content (such as indications of pollresults or page popularity). The search engine may collect and storecomment data, such as part of the process of indexing pages. The displayof page comments within a SERP result may include a trigger event (orselection) and a display mechanism. The trigger event, which functionsas a request to see the comments for the indexed page associated with aselected page indicator 112, may be a shift-click, a mouse-over event(such as a hover), or other detectable event or action associated withthe page indicator. The trigger event for the display of comments maydiffer from that for the display of a preview (e.g., shift-click for oneand alt-click for the other). A display mechanism may be a pop-upwindow, a rollover image, a refreshed version of the SERP that includesthe page comments, or other presentation of the comments. Accessingcomments from the SERP may allow the user to review pagerecommendations, e.g., as an integral part of evaluating search results.

Referring now also to FIG. 15, web page 82 may display page comments 180and provide mechanisms 182 for contributing comments 180. When indexingweb page 82, search engine 68 may index all or part of article 98 andindex and/or store comments 180. When generating SERP 78, the indexedarticle and/or comments may contribute to the paging ranking processthat places the page in SERP result list 104 generated for a givenquery. Page block 110 in result item 106 associated with web page 82 mayinclude set of page indicators 112 corresponding to page buttons 88 ofthe indexed article. In the example of FIG. 15, the trigger event is amouse-over, in this case hovering the mouse over page indicator 112A.Detecting the mouse-over (e.g., via a client-side script) triggers thedisplay mechanism, in this case pop-up window 184 containing comments186.

In an embodiment, the SERP may contain the comment text as hiddencontent present in the original SERP code, and the display mechanism maychange the comment text from hidden to visible via CSS, script, or othermeans. In an embodiment, the search engine may, in response to thetrigger event, dynamically push comment text stored on the search serverto web browser for display via the display mechanism. In an embodiment,page block 110 in a SERP may provide a mechanism for indicatingrecommendations provided by the search engine to the user, such as byreferring to data associated with the user, identifying one or morepages in the page block that correlate to the user data, and drawingattention to pages in the page block based on the correlation.

A search engine may collect data about it users. For example, a searchengine may allow each user to establish an account via its web site andencourage each user to disclose demographic data, preference data, andother information. For example, a search engine web site may endeavor toestablish a tracking mechanism, such as cookie file on each user'scomputer to collect ongoing data about the user's search habits.Additionally, a search engine may endeavor to embed a tracking(analytics) script on one or more web sites and use the script toobserve user behavior within a site and/or between multiple sites.Different sources of user data potentially may be cross-correlated.

A user's data may be used to predict the user's interests. In anembodiment, a user's data may be cross-referenced to SERP result item106 that includes page block 110 and further cross-referenced to eachpage indicator 112 in the page block. The cross-reference operation mayidentify one or more pages in the statically paginated set thatcorrelate to the user data. This correlation may predict the user'sinterest in those pages. The search engine accordingly may recommendcorrelated pages within the page block to the user by, for example,applying a distinctive indication to page indicators 112 associated withrecommended pages. This recommendation represents a match based on theuser data (e.g., user history) instead of, in addition to, or incombination with a match based on the query (e.g., keywords).

Referring now also to FIG. 16, the recommendation may take the form of arecommendation indicator applied to or associated with the recommendedpages in the page block. For example, the search engine may generatepage indicators with an associated “recommended” shape, symbol, icon,label, or other device that identifies the recommended pages. In theexample of FIG. 16, a recommended-page indicator 118 consists of astar-shaped page indicator, calling attention to the recommendation ofpage 24 in page block 110.

Recommendations may occur by other criteria. For example, a user may bea member of a membership site, such as a social media site. The searchengine may associate that membership with that user via a record in theuser's user data (such as after the user or site discloses themembership), or after the search engine discovers the membership (suchas during the indexing process). The membership site may in turnassociate members in groups, such as groups of friends or colleagues. Inan embodiment, a search engine may identify a search performed by auser, cross-reference the search to the user's user data includingmemberships, cross-reference the memberships to (for example) data, suchas lists of friends and colleagues, and recommend pages based on thederived data (e.g., pages that mention friends or colleagues).

To build an index, a search engine may visit at least one web page,obtain and analyze the content and/or code of each page, construct asearchable index that includes references to the visited pages,occasionally update the index, etc. For some or all of these tasks, thesearch engine may employ a hardware/software system called a “spider,”which may autonomously follow links to find web pages and otherresources. After finding a page, the search engine may analyze and indexit. This processing may include parsing the page code (includingincluded files if appropriate) to identify hyperlinks (e.g., by scanningthe HTML, scripts, and/or other associated code for tags and/orinstructions that encode links). For example, HTML tags that encodelinks may follow this syntax: <a href=“URL”>LINK</a> where URLrepresents the hypertext reference (the web page or other resourceopened by the link) and LINK represents the anchor (the visible text orimage that, when clicked, activates the link). A basic syntax for theURL portion of a link is: scheme://server.domain/resource where“scheme://” is a protocol, such as “http” or “https”, “server” is amachine name, such as “www”; “domain” is an IP address or a name thatresolves to an IP address, such as “foo.com”; and “resource” (ifpresent) is the path name of a resource, such as that of a particularHTML file, e.g., “page_(—)1.htm”. Combining the examples yields thisURL: http://www.foo.com/page_(—)1.html. A generalized HTML and URLsyntax may contain other elements.

While parsing a page for links, the search engine may build and store alist of links found on that page. For each listed link, the searchengine may store link data, such as the URL and LINK portions of thecode. The result is a list of zero or more links present on the page.The search engine may analyze the list, such as to identify visited andunvisited pages and to find relationships between pages.

The process of recognizing a set of statically paginated pages, such asto identify the browse sequence of those pages, may begin when thesearch engine visits a first page, parses the page, and builds list oflinks contained in the page. The search engine then selects a secondpage from the first-page list of links, visits and parses the secondpage, and builds a list of links for the second page. The search enginemay analyze the second-page list to detect the presence or absence of atleast one link to the first page. If present, the first page links tothe second, and the second to the first. This pair of interlinked pagesmay be include a minimal browse sequence and a candidate for beingdisplayed, in a SERP that refers to either of the indexed pages, viapage block 110 with page indicators 112.

On completing and analyzing the second-page list of links, the searchengine may return to the first-page list, select a third page ifpresent, build a list of links for the third page, and analyze thethird-page list for links to the first page and/or second page. Ifpresent, these links indicate that the third page may be a member of thebrowse sequence. The process continues for subsequent pages until thesearch engine has analyzed all of the first-page links and unvisitedsecond-, third-, and subsequent-page links. An option to simplify theprocessing is to limit the search to links within the same domain nameas the first page, implementing the assumption that pages in the samebrowse sequence are usually hosted on one web site.

The general goal in identifying a browse sequence is to detect pairs ofinterlinked pages that form a chain of interlinked pages. For example,the goal is to detect a first page linked to a second page, the secondpage being linked to the first page and to a third page, the third pagebeing linked to the second page and to a fourth page, etc. The innermembers of the series may be interlinked with both upper and lowerneighbors, forming a chain. The initial page may omit the link to itsabsent lower neighbor, and the final page may omit the link to itsabsent upper neighbor (a linear browse sequence). Alternatively, theinitial and final pages may form an interlinked pair (a circular browsesequence).

Referring now also to FIG. 17, analysis of a first page 190A yields alist of links 192A containing links 194A-C; analysis of a second page1908 yields list 1928 containing links 195A-D, and analysis of a thirdpage 190C yields a list of links 192C containing links 196A-C. Analysisof first-page list 192A shows that link 194C refers to second page 190B,and analysis of second-page list 192B shows a link to first page 190A,indicating that pages 190A and 192 are interlinked. Analysis ofsecond-page list 192B also shows a link 195C to third page 190C, andanalysis of third-page list 192C shows a link 196A to second page 190B,indicating that pages 190B and 190C are interlinked. Overall, theanalysis detects a chain of interlinked pages, 190A to/from 190B to/from190C. The analysis therefore detects a browse sequence for thestatically paginated web pages.

The goal of identifying relationships of statically paginated web pagesmay simplify the analysis task, such as by allowing the analysis toconsider only URLs with the http or https protocol and only URLs thatrepresent web pages and by excluding other file types that may beencountered on the web. Detecting semantic file names (such aspage1.html, page2.html, and page3.html) may simplify the analysis,especially because many browse sequences are constructedprogrammatically and follow predictable file naming conventions.Detecting semantic anchor names (such as page numbers,first-page/last-page indications, and/or previous-page/next pageindications) may simplify analysis because anchor names may be selectedto highlight the browse sequence to the reader. Detecting and analyzing<div> structure may simplify analysis, since many designs placerecurring navigation links inside a <div>, which may have a semanticallymeaningful identifier. Detecting patterns in generated code associatedwith popular CMS tools may simplify analysis. For example, WordPressblogs may generate browse sequences and page-navigation features in adistinctive way, while Joomla! sites may generate browse sequences andpage-navigation features in a different distinctive way. Parsing pagecode for indications of popular authoring tools may sometimes aid theanalysis and improve accuracy, such as by setting limits on the searchspace.

In an embodiment, files that have native pagination can be parsed todetect the pagination. PDF files, for example, may contain an overt pagestructure (or static pagination) expressed in the PostScript language.Parsing the PostScript code for page breaks, page numbers, and otherpage indicia during indexing may allow the search engine to provide pageblock 110 and page indicators 112 for the PDF file when present in SERPresult list 104. Other file types with native pagination, such as wordprocessor, spreadsheet, or presentation software files, may lendthemselves to equivalent page-based analysis, indexing, and SERPdisplay.

After detecting a browse sequence for statically paginated web pages(such as for article 98 that spans multiple pages), the search enginemay index the article as a paginated unit to expedite generating resultitem 106 for the article that includes page block 110. The search engineaccordingly may maintain a record of the association and sequence ofpages in the browse sequence and generate the corresponding pageindicators according to the content of the associated pages. In additionto displaying the article as a unit in a page block, a search engine mayalso index and display the separate pages. That is, the search enginemay sometimes generate result item 106 that references only one page ofthe browse sequence, independent from the rest of the browse sequence.

When a conventional search engine receives a query from a web browser,it may compare the query to the index, select items from the index that(by certain criteria) match the query, construct a SERP, and return theSERP to the requesting browser. When a search engine receives a query,it may perform further processing for result items associated withstatically paginated pages. For example, when indexing a staticallypaginated set of pages, the search engine may keep records of staticallypaginated sets, the associations among pages in a given set, the browsesequence of those pages, the membership each page in zero or more sets,etc. An index entry for a set or a member of set may include browsesequence data. The browse sequence data may include a flag that marksthe entry a reference to a statically paginated set of pages; or thedata may include or refer to a description of the statically paginatedset (such as a list of the URLs in the set); or the data may include aunique identifier associated with the set (e.g., to look up related dataor track access to the set from the SERP). In general, the search enginemay collect and maintain records related to statically paginated webpages, such as part of the process of finding and indexing web pages.The search engine, by reference to these records, may distinguishbetween result items 106 that may contain page block 110 from resultitems for non-static pages that do not contain page block 110.

On receipt of a query, a search engine may generate a SERP that containsresult list 104 that contains zero or more result items 106 related tothe query. If result item 106 refers to a statically paginated set ormember of the set, then the search engine may generate page block 110 todisplay the browse sequence of that set and include page block 110 (suchas a portion of the associated result item). To generate the page block,the search engine may analyze its records of the statically paginatedset. For example, the search engine may determine the number of pages inthe set, measure the match between the query and/or keywords and eachpage, build a page preview, check for user-added comments for the page,check for potential recommendations, etc.

The search engine may select pages in the set for display in the pageblock. For example, if the number of pages in the set is too large toinclude page indicator 112 for each page in the page block, then thesearch engine may select pages to include or exclude. The criterion forselection may depend on the embodiment of the page block. For example,in an embodiment that limits the page block to a range of pageindicators, the search engine may select the strongest single match inthe set, center it in the page block, and add upper and lower pages tocomplete the range.

The search engine may generate a page indicator for each page. Forexample, if the page block displays a range of pages, then the searchengine may, for each page in the range, generate a page indicator with aselected anchor and URL. The anchor may be a text anchor, a buttongenerated as an image file, a button expressed in CSS, or otherwiseprovided. The label of the anchor, whether text or image, may beselected according to the referenced page. For example, if thereferenced page is the fourth page of a set, then the label may be thedigit “4.” Labels for first-page, last-page, next-page, previous-page,and omitted-page indicators may be similarly determined, each accordingto its function. The URL portion of the page indicator may be selectedaccording to its function in the context of the SERP. For example, hitand miss indicators may include a URL that opens the current version ofthe page, such as by directing the browser to the hosting site.First-page, last-page, next-page, previous-page, and omitted pageindicators may in some cases open referenced file and in other casesrefresh the SERP so that the page block includes a different selectionof pages. For example, clicking NEXT may refresh the SERP with anincremented page block.

In some embodiments, generating the page indicators may involvegenerating additional code. In an embodiment that provides a pop-up pagepreview triggered by a mouse-over event, for example, the pageindicators may include or refer to script or other code that implementsthe feature. Page previews and other images may be preloaded with theSERP or delivered on request.

Styling for the page block and page indicators may be standardized,adapted from the indexed set of pages, or otherwise determined. Forexample, the size, shape, color, and other attributes of page indicatorsmay reflect those of the page navigator and page buttons of the indexedpage. Emulating the indexed page may require parsing its HTML, CSS, orscript code or other analysis (e.g., to identify attributes applied topage navigator 86, page buttons 88, etc.) found on the indexed page.

Referring now also to FIG. 18, a method 200 for displaying a browsesequence for a plurality of statically paginated web pages on a searchengine results page may include identifying, in the source code of oneweb page (or a first page), one or more links to at least another webpage (or at least a second page) at 202; identifying, in the source codeof the at least another web page, one or more links to the one web pageat 204; determining a browse sequence for the one web page and the atleast another web page based on the identified one or more links to theat least another web page and to the one web page at 206; and displayingthe browse sequence along with search results on a search engine resultspage (SERP) at 208, the search results including information regardingone or more of the one web page and the at least another web page.Method 200 may include other, alternative, or additional elements; mayomit one or more elements; and/or may follow a different sequence ofelements from that listed.

Identifying links in the source code of a first web page may includeobtaining a copy of the source code of the page (e.g., by visiting thepage with a spider, which may be a search engine component that crawlsthe web to find pages and return page code to a search engine).Identifying the above links may include parsing the obtained code of thefirst web page (including referenced files) to identify hyperlinks, suchas by scanning the HTML and/or associated code (e.g., scripts for tagsand/or instructions that encode links). Additionally, identifying theabove links may include building a list of links found in the page. Foreach link, the list may include an anchor, a URL, and/or other data. Inan embodiment, the list may include only links to web pages and/or onlylinks in the same domain as the first page.

Identifying, in the source code of a second web page, one or more linksto the first web page may include selecting the second page by selectinga link from the list of links constructed above. Identifying the abovelinks may include obtaining a copy of the source code of the second page(e.g., by visiting the page with a spider via the URL obtained from thelist). Additionally, identifying the above links may include retaining arecord of the first page (e.g., by storing its URL as the referring URL)to aid in identifying links in the second page that refer to the firstpage. Identifying the above links may include parsing the obtained codefor links, building a list of links found in the second page, andcomparing the URL for each link in the second-page list with the URL ofthe first page (i.e., the referring URL). If the URL of the second-pagelink matches the first-page URL, then the second-page list includes oneor more links to the first web page.

Determining a browse sequence for the first page and the second pagebased on the identified links may include detecting whether the firstpage and the second page are interlinked web pages. For example,identifying links in the first page may include building a list of linksfound in the first page and selecting the second page from the list.This selection method assures that the first page is linked to thesecond page. Identifying links in the second page in turn may includebuilding a list of links found in the second page and analyzing the listfor the presence or absence of at least one link to the first page(e.g., by comparing the URL of each link in the list to URL of the firstpage). If at least one link to the first page is present, then the firstpage and the second page are an interlinked pair, which determines thatthe first and second pages are statically paginated and include a browsesequence.

Displaying the browse sequence along with the search results on a SERPmay include matching a query to an index, selecting a result from theindex, determining if the selected result refers to a set of staticallypaginated pages, and generating a corresponding result item to includein the SERP result list. Displaying the browse sequence may includeselecting and including information, such as a page title and snippetassociated with the page from the index or other sources.

For a result item that refers to set of statically paginated pages,displaying the browse sequence may include generating and including aplurality of page indicators, which may sometimes may be referred to asbuttons. The sequence of the page indicators, and the anchor and URL ofeach page indicator, may reflect or represent the browse sequence of thereferenced pages. Each page indicator (or button) accordingly mayinclude page indicium (such as a label or an anchor) that refers to thereferenced page. The page indicia associated with each page indicator(or button) may include page number indicia. For example, if the browsesequence includes first, second, and third pages, then the correspondingpage indicators may be arranged in the same sequence, labeled with theunderlying page numbers (which may be digits, letters, names, etc.) andlinked to each page in series.

Displaying the browse sequence may additionally include incorporating alink to the associated page in the corresponding page indicator. Forexample, the page indicator associated with a first page may link to thefirst page via its URL; the page indicator associated with a second pagemay link to the second page via its URL; and so on for subsequent pageindicators. Displaying the browse sequence may further includedetermining the type of page indicator to use for each page andgenerating the appropriate page indicator. For example, the pageindicator for a matching page may take the form of a hit indicator, andthe page indicator for a non-matching page may take the form of a missindicator. Displaying the browse sequence may additionally includegenerating next-page, previous-page, first-page, last-page, and/oromitted-page indicators, each with a suitable anchor and hypertextreference (URL) (e.g., to provide a page block on the SERP comparable toa page navigator on a web page).

In an embodiment, displaying the browse sequence may further includegenerating a preview of one of the one web page and the at least anotherweb page when a page indicator corresponding to the one of pages isselected from the SERP. Generating a preview may include preparing athumbnail image, text (such as summary text), or other reducedrepresentation of the indexed page (e.g., as part of the process ofobtaining and analyzing page code to place references to the page in anindex). Generating a preview may include transmitting a copy of thepreview image or text to the browser. The transmission may occur onrequest or substantially in real time after triggering event (orselection) or when transmitting the SERP, such as a hidden imagepreloaded in the background by a script in the SERP). The triggeringevent or selection for a preview may be distinct from the triggeringevents that open a page or that request display of user comments. Forexample, clicking the page indicator may open the associated page, whilea mouse-over event (such as a hover) may display the preview. Displayingthe browse sequence may include invoking a display mechanism, such as apop up window, rollover image, or refreshed version of the SERPcontaining the preview image or text. Each page indicator in a pageblock may have a distinct associated preview.

In an embodiment, displaying the browse sequence may further includereceiving comments from one or more users of one or more pagesrepresented by displayed page indicators. Receiving comments may includecollecting, storing, and indexing comments entered on a page by itsusers. For example, a search engine spider may, when returning page codefor indexing, collect and return user comments, which may include textand/or images. Receiving comments may include parsing the page code todetect comments, such as by scanning the code for features used tocollect and display comments. Receiving comments may include extractingdetected comments from the rest of the page, storing and maintainingcomment data, and associating the stored data with the commented page,such as to expedite displaying comments from the page indicator for thepage.

Displaying the browse sequence may additionally include displaying thereceived comments, such as when the page indicator corresponding to thecommented page is selected from the SERP. Displaying comments mayinclude transmitting a copy of the comment data to the browser. Thetransmission may occur after a trigger event or while transmitting theSERP, such as hidden text that can become visible text (e.g., bychanging its display attribute in CSS). The triggering event (orselection) for comment text may be distinct from the triggering eventsthat open a page or request a preview. For example, clicking a pageindicator may open the associated page, while shift-clicking theindicator may instead display the associated comments. Displaying thebrowse sequence may include invoking a display mechanism, such as apop-up window, rollover image, or refreshed version of the SERPcontaining the comments. Each page indicator in a page block may havedistinct associated comments.

In an embodiment, displaying the browse sequence may further includedisplaying at least one search term indicator (or keyword indicator)with one or more page indicators of the plurality of page indicators.Displaying a search term indicator may include calculating and storing apage-match or page-rank value, for at least the displayed pageindicators, for each keyword or key phrase in the query associated withthe SERP. These separate values may be components of the index-rankingprocess applied to the page as a whole. Displaying a search termindicator may include displaying the keyword-specific indications foreach page in conjunction with the associated page indicator.

Displaying a search term indicator may include representing thekeyword-specific page match data as a numeric value, bar graph, and/orsymbol, such as circle or dot applied inside or outside the perimeter ofthe page indicator. The keyword-specific values may be represented ashit or miss values, such as after comparing scores to a threshold value.A dot in the upper-left corner of a page indicator, for example, mayindicate that the first keyword in the query matched the page associatedwith that keyword.

In an embodiment, displaying a search term indicator may includedisplaying the number of occurrences of an associated keyword. Forexample, a page indicator may include a pop-up feature that is triggeredby an event (such as a shift-click) that displays a table of associatedkeywords, each with associated counts, scores, and/or statistics. In anembodiment, displaying a search term indicator may include displaying,for each displayed page indicator, an indication of each matchingkeyword. For example, if a query contains first, second, and thirdkeywords, and a result item includes first and second page indicators,then each of the two page indicators may display or omit a keywordindicator for each of the three keywords. For example, if the firstkeyword matches both pages, the second keyword matches only the secondpage, and the third keyword does not match either page, then the firstpage indicator may include only the first keyword indicator, the secondpage indicator may include both the first and second keyword indicators,and the third keyword indicator may be absent from both pages.

Method 200 may further include incorporating links to each of the firstpage and second page in the displayed browse sequence. For example, eachpage indicator in a page block may include a hypertext reference thatencodes a URL directed at the associated web page, thereby incorporatinglinks in the browse sequence displayed in the SERP that correspond tothe browse sequence between the first page, second page, and subsequentpages (if any).

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the describedinventions. As used herein, the singular forms “a,” “an,” and “the” areintended to include the plural forms as well, unless the context clearlyindicates otherwise. It will be further understood that the terms“comprises” and/or “comprising,” when used in this specification,specify the presence of stated features, integers, steps, operations,elements, and/or components, but do not preclude the presence oraddition of one or more other features, integers, steps, operations,elements, components, and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below are intended toinclude any structure, material, or act for performing the function incombination with other claimed elements as specifically claimed. Thedescription of the present inventions has been presented for purposes ofillustration and description, but is not intended to be exhaustive orlimited to the inventions in the form disclosed. For example, theinvention may be embodied in an environment that is not part of arevision control system. Many modifications and variations will beapparent to those of ordinary skill in the art without departing fromthe scope and spirit of the inventions. The embodiments were chosen anddescribed in order to best explain the principles of the inventions andthe practical application, and to enable others of ordinary skill in theart to understand the inventions for various embodiments with variousmodifications as are suited to the particular use contemplated.

1-11. (canceled)
 12. A computer system, comprising: a processor; amemory; and a program comprising a plurality of instructions stored inthe memory that are executed by the processor to: identify, in thesource code of one web page, one or more links to at least another webpage; identify, in the source code of the at least another web page, oneor more links to the one web page; determine a browse sequence for theone web page and the at least another web page based on the identifiedone or more links to the at least another web page and to the one webpage; and display the browse sequence along with search results on asearch results engine results page, the search results includinginformation regarding one or more of the one web page and the at leastanother web page.
 13. The computer system of claim 12, wherein theplurality of instructions further comprises instructions that areexecuted by the processor to display the browse sequence as a pluralityof page indicators.
 14. The computer system of claim 13, wherein theplurality of instructions further comprises instructions that areexecuted by the processor to incorporate a link to one of the one webpage and the at least another web page in each page indicator of theplurality of page indicators.
 15. The computer system of claim 13,wherein the plurality of instructions further comprises instructionsthat are executed by the processor to generate a preview of one of theone web page and the at least another web page when a page indicatorcorresponding to the one of the one web page and the at least anotherweb page is selected from the search engine results page.
 16. Thecomputer system of claim 13, wherein the plurality of instructionsfurther comprises instructions that are executed by the processor to:receive comments from one or more users for one of the one web page andthe at least another web page; and display the received comments when apage indicator corresponding to the one of the one web page and the atleast another web page is selected from the search engine results page.17. The computer system of claim 13, wherein the plurality ofinstructions further comprises instructions that are executed by theprocessor to display a first search term indicator that represents thenumber of occurrences of a first search term with each page indicator ofa web page that includes the first search term, the first search termbeing used to generate the search results on the search engine resultspage.
 18. The computer system of claim 17, wherein the plurality ofinstructions further comprises instructions that are executed by theprocessor to display a second search term indicator that represents thenumber of occurrences of a second search term with each page indicatorof a web page that includes the second search term, the second searchterm being used, with the first search term, to generate the searchresults on the search engine results page.
 19. A computer programproduct for displaying a browse sequence for a plurality of staticallypaginated web pages on a search engine results page, the computerprogram product comprising: at least one computer readable storagemedium having computer readable program instructions embodied therewith,the computer readable program instructions, when read by a processor,being configured to: identify, in the source code of one web page, oneor more links to at least another web page; identify, in the source codeof the at least another web page, one or more links to the one web page;determine a browse sequence for the one web page and the at leastanother web page based on the identified one or more links to the atleast another web page and to the one web page; and display the browsesequence along with search results on a search engine results page, thesearch results including information regarding one or more of the oneweb page and the at least another web page.
 20. The computer programproduct of claim 19, wherein the computer readable program instructions,when read by a processor, are further configured to display the browsesequence as a plurality of page indicators.
 21. The computer programproduct of claim 20, wherein the computer readable program instructions,when read by a processor, are further configured to incorporate a linkto one of the one web page and the at least another web page in eachpage indicator of the plurality of page indicators.
 22. The computerprogram product of claim 20, wherein the computer readable programinstructions, when read by a processor, are further configured togenerate a preview of one of the one web page and the at least anotherweb page when a page indicator corresponding to the one of the one webpage and the at least another web page is selected from the searchengine results page.
 23. The computer program product of claim 20,wherein the computer readable program instructions, when read by aprocessor, are further configured to: receive comments from one or moreusers for one of the one web page and the at least another web page; anddisplay the received comments when a page indicator corresponding to theone of the one web page and the at least another web page is selectedfrom the search engine results page.
 24. The computer program product ofclaim 20, wherein the computer readable program instructions, when readby a processor, are further configured to display a first search termindicator that represents the number of occurrences of a first searchterm with each page indicator of a web page that includes the firstsearch term, the first search term being used to generate the searchresults on the search engine results page.
 25. The computer programproduct of claim 24, wherein the computer readable program instructions,when read by a processor, are further configured to display a secondsearch term indicator with each page indicator of a webpage thatincludes a second search term, the first and second search terms beingused to generate the search results on the search engine results page.